Space complexity equivalence of P systems with active membranes and Turing machines

An Efficient Simulation of Polynomial-Space Turing Machines by P Systems with Active Membranes

We show that a deterministic single-tape Turing machine, operating in polynomial space with respect to the input length, can be efficiently simulated (both in terms of time and space) by a semi-uniform family of P systems with active membranes and three polarizations, using only communication rules. Then, basing upon this simulation, we prove that a result similar to the space hierarchy theorem...

Turing Incompleteness of Asynchronous P Systems with Active Membranes

We prove that asynchronous P systems with active membranes without division rules can be simulated by place/transition Petri nets, and hence are computationally weaker than Turing machines. This result holds even if the synchronisation mechanisms provided by electrical charges and membrane dissolution are exploited.

Constant-Space P Systems with Active Membranes

We continue the investigation of the computational power of spaceconstrained P systems. We show that only a constant amount of space is needed in order to simulate a polynomial-space bounded Turing machine. Due to this result, we propose an alternative definition of space complexity for P systems, where the amount of information contained in individual objects and membrane labels is also taken ...

Space Complexity in Infinite Time Turing Machines

Polarizationless P Systems with Active Membranes: Computational Complexity Aspects

P systems with active membranes, in their classical definition, make use of noncooperative rules only. However, it is well known that in living cells, proteins interact among them yielding new products. Inspired by this biological phenomenon, the previous framework is reformulated in this paper, allowing cooperation in object evolution rules, while removing electrical charges associated with me...